Models for Substructural Arithmetics
نویسندگان
چکیده
This paper explores models for arithmetics in substructural logics. In the existing literature on substructural arithmetic, frame semantics for substructural logics are absent. We will start to fill in the picture in this paper by examining frame semantics for the substructural logics C (linear logic plus distribution), R (relevant logic) and CK (C plus weakening). The eventual goal is to find negation complete models for arithmetic in R.
منابع مشابه
A Canonical Model Construction for Substructural Logics
In this paper, we introduce a class of substructural logics, called normal substructural logics, which includes not only relevant logic, BCK logic, linear logic and the Lambek calculus but also weak logics with strict implication, and de ne Kripkestyle semantics (Kripke frames and models) for normal substructural logics. Then we show a correspondence between axioms and properties on frames, and...
متن کاملDiscrete Implicit Surface Models using Interval Arithmetics
This article presents a new method for generating discrete implicit surface models using interval arithmetics. This approach is unique to our knowledge and has the advantage of profiting of voxel representation for both modelling and visualization purposes. We’ve adopted high discrete resolutions to obtain better surface represention and realistic visualisation. Interval arithmetics guarantees ...
متن کاملPrediction of the adsorption capability onto activated carbon of liquid aliphatic alcohols using molecular fragments method
Quantitative structure-property relationship (QSPR) for estimating the adsorption of aliphatic alcohols onto activated carbon were developed using substructural molecular fragments (SMF) method. The adsorption capacity of activated carbon (gr/100grC) for 150 aliphatic alcohols onto activated carbon (AC) is studied under equilibrium conditions. Forward and backwards stepwise regression variable ...
متن کاملArithmetics in finite but potentially infinite worlds
Let FM(A), for A = (ω, R̄), be the family of finite models being initial segments of A. The thesis investigates logical properties of families of the form FM(A) for various arithmetics like arithmetic of addition and multiplication, Skolem arithmetic of multiplication, arithmetic of coprimality, of exponentiation and arithmetic of concatenation. We concentrate on questions such as decidability o...
متن کاملAn outline of the dissertation ,,Arithmetics in finite but potentially infinite worlds”
In the dissertation we examine logical properties of finite arithmetics. Finite models with built-in arithmetical relations have gained an attention due to their ability to express concepts related to computational complexity. It was shown, for example, that the logic with the fixed point operator expresses on models with linear order exactly those properties which are computable in determinist...
متن کامل